Ja n 20 04 Involutions Restricted by 3412 , Continued Fractions , and Chebyshev Polynomials
نویسندگان
چکیده
We study generating functions for the number of involutions, even involutions, and odd involutions in Sn subject to two restrictions. One restriction is that the involution avoid 3412 or contain 3412 exactly once. The other restriction is that the involution avoid another pattern τ or contain τ exactly once. In many cases we express these generating functions in terms of Chebyshev polynomials of the second kind.
منابع مشابه
ul 2 00 3 Restricted 3412 - Avoiding Involutions : Continued Fractions , Chebyshev Polynomials and Enumerations ∗
Several authors have examined connections among restricted permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for involutions which avoid 3412. Our results include a recursive procedure for computing the generating function for involutions which avoid 3412 and any set of additional patterns. We use our results to gi...
متن کاملar X iv : m at h / 01 08 04 3 v 1 [ m at h . C O ] 6 A ug 2 00 1 Restricted set of patterns , continued fractions , and Chebyshev polynomials
We study generating functions for the number of permutations in Sn subject to set of restrictions. One of the restrictions belongs to S3, while the others to Sk. It turns out that in a large variety of cases the answer can be expressed via continued fractions, and Chebyshev polynomials of the second kind. 2001 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 30B70 42C05
متن کاملRestricted colored permutations and Chebyshev polynomials
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for colored permutations. First we define a distinguished set of length two and length three patterns, which contains only 312 when just one color is used. Then we give a recursive procedure for computing the generating functio...
متن کاملRestricted 132 - Involutions
We study generating functions for the number of involutions of length n avoiding (or containing exactly once) 132 and avoiding (or containing exactly once) an arbitrary permutation τ of length k. In several interesting cases these generating functions depend only on k and can be expressed via Chebyshev polynomials of the second kind. In particular, we show that involutions of length n avoiding ...
متن کامل